Optimal box-covering algorithm for fractal dimension of complex networks
نویسندگان
چکیده
Christian M. Schneider, 2, ∗ Tobias A. Kesselring, José S. Andrade Jr., and Hans J. Herrmann 3 Computational Physics, IfB, ETH Zurich, Schafmattstrasse 6, 8093 Zurich, Switzerland Department of Civil and Environmental Engineering, MIT, 77 Massachusetts Avenue, Cambridge, MA 02139, USA Departamento de F́ısica, Universidade Federal do Ceará, 60451-970 Fortaleza, Ceará, Brazil (Dated: February 25, 2012)
منابع مشابه
Box-covering algorithm for fractal dimension of weighted networks.
Box-covering algorithm is a widely used method to measure the fractal dimension of complex networks. Existing researches mainly deal with the fractal dimension of unweighted networks. Here, the classical box covering algorithm is modified to deal with the fractal dimension of weighted networks. Box size length is obtained by accumulating the distance between two nodes connected directly and gra...
متن کاملA new information dimension of complex networks
The fractal and self-similarity properties are revealed in many real complex networks. However, the classical information dimension of complex networks is not practical for real complex networks. In this paper, a new information dimension to characterize the dimension of complex networks is proposed. The difference of information for each box in the box-covering algorithm of complex networks is...
متن کاملHow to calculate the fractal dimension of a complex network: the box covering algorithm
Covering a network with the minimum possible number of boxes can reveal interesting features for the network structure, especially in terms of self-similar or fractal characteristics. Considerable attention has been recently devoted to this problem, with the finding that many real networks are self-similar fractals. Here we present, compare and study in detail a number of algorithms that we hav...
متن کاملAnalysis of Resting-State fMRI Topological Graph Theory Properties in Methamphetamine Drug Users Applying Box-Counting Fractal Dimension
Introduction: Graph theoretical analysis of functional Magnetic Resonance Imaging (fMRI) data has provided new measures of mapping human brain in vivo. Of all methods to measure the functional connectivity between regions, Linear Correlation (LC) calculation of activity time series of the brain regions as a linear measure is considered the most ubiquitous one. The strength of the dependence obl...
متن کاملExploring self-similarity of complex cellular networks: the edge-covering method with simulated annealing and log-periodic sampling
Song, Havlin and Makse (2005) have recently used a version of the box-counting method, called the node-covering method, to quantify the self-similar properties of 43 cellular networks: the minimal number NV of boxes of size l needed to cover all the nodes of a cellular network was found to scale as the power law NV ∼ (l+1) −DV with a fractal dimension DV = 3.53±0.26. We propose a new box-counti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1204.3010 شماره
صفحات -
تاریخ انتشار 2012